Paired Pointset Traversal
نویسندگان
چکیده
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that both a π(1), . . . , aπ(n) and bπ(1), . . . , bπ(n) are self-avoiding polygonal arcs? We show thatPaired Pointset Traversal is NP-complete. This has consequences for the complexity of computing the Fréchet distance of two-dimensional surfaces.
منابع مشابه
A Numerical Study of Hierarchical Matrix (h-matrix) for Finite Point Set Method (fpm) on Solving a Poisson Problem
A class of matrices called H-matrices is used to approximate large matrices of grid based methods. H-matrix arithmetic has linear-logarithmic complexity for some special grids. In this paper, we present a study on Hmatrix for a large sparse un-patterned system arising from a grid free method called finite pointset method applied on a Poisson problem with mixed boundary conditions. AMS Subject C...
متن کاملGrid-free Particle Method for the Inhomogeneous Enskog Equation and Its Application to a Riemann-problem
Starting from the molliied version of the Enskog equation for a hard-sphere uid, a grid-free algorithm to obtain the solution is proposed. The algorithm is based on the nite pointset method. For illustration, it is applied to a Riemann problem. The shock-wave solution is compared to the results of Frezzotti and Sgarra where a good agreement is found.
متن کاملOn the Efficiency of Simulation Methods for the Boltzmann Equation on Parallel Computers
The paper presents a parallelization technique for the finite pointset method, a numerical method for rarefied gas flows. First we give a short introduction to the Boltzmann equation, which describes the behaviour of rarefied gas flows. The basic ideas of the finite pointset method are presented and a strategy to parallelize the algorithm will be explained. It is shown that a static processor p...
متن کاملVisiting All Sites with Your Dog
Given a polygonal curve P , a pointset S, and an ε > 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Fréchet distance less or equal to ε to curve P . In this problem, Q must visit every point in S and we are allowed to reuse points of pointset in building Q. First, we show that this problem in NP-Complete. Then, we present a polynomial time algorithm f...
متن کاملMeraculous: De Novo Genome Assembly with Short Paired-End Reads
We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast Pichia stipitis. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer...
متن کامل